Almost Disjoint Triangles in 3-Space
نویسندگان
چکیده
Two triangles are called almost disjoint if they are either disjoint or their intersection consists of one common vertex. Let f (n) denote the maximum number of pairwise almost disjoint triangles that can be found on some vertex set of n points in 3-space. Here we prove that f (n) = (n3/2).
منابع مشابه
Lines Tangent to Four Triangles in Three-Dimensional Space
We investigate the lines tangent to four triangles in R3. By a construction, there can be as many as 62 tangents. We show that there are at most 162 connected components of tangents, and at most 156 if the triangles are disjoint. In addition, if the triangles are in (algebraic) general position, then the number of tangents is finite and it is always even.
متن کامل. M G ] 2 7 Fe b 20 05 LINE TANGENTS TO FOUR TRIANGLES IN THREE - DIMENSIONAL SPACE
We investigate the lines tangent to four triangles in R 3. By a construction, there can be as many as 62 tangents. We show that there are at most 162 connected components of tangents, and at most 156 if the triangles are disjoint. In addition, if the triangles are in (algebraic) general position, then the number of tangents is finite and it is always even.
متن کاملPacking edge-disjoint triangles in regular and almost regular tournaments
For a tournament T , let ν3(T ) denote the maximum number of pairwise edge-disjoint triangles (directed cycles of length 3) in T . Let ν3(n) denote the minimum of ν3(T ) ranging over all regular tournaments with n vertices (n odd). We conjecture that ν3(n) = (1 + o(1))n /9 and prove that n 11.43 (1− o(1)) ≤ ν3(n) ≤ n 9 (1 + o(1)) improving upon the best known upper bound of n −1 8 and lower bou...
متن کاملRay-Shooting on Triangles in 3-Space1
We present a uniform approach to problems involving lines in 3-space. This approach is based on mapping lines in R 3 into points and hyperplanes in 5-dimensional projective space (Pl ucker space). We obtain new results on the following problems: 1. Preprocess n triangles so as to eeciently answer the query: \Given a ray, which is the rst triangle hit?" (Ray-shooting problem). We discuss the ray...
متن کاملNew Streaming Algorithms for Counting Triangles in Graphs
We present three streaming algorithms that (2, δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presented algorithms are inversely proportional to the number of triangles while, for some families of graphs, the space usage is improved. We also prove a lower bound, based on the number of triangles, which indicates that our first algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 28 شماره
صفحات -
تاریخ انتشار 2002